Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics

This paper introduces a multi-period, two-dimensional vehicle loading and dispatching problem, called Two-Dimensional Vehicle Loading Dispatching Problem with Incompatibility Constraints (VLDP). The problem concerns preparing single-origin single-destination transportation plan of required orders to vehicles at the origin deliver destination within their due dates. decision maker uses own fleet vehicles, each having fixed cost per trip, may outsource additional higher cost. VLDP involves constraints regarding dates orders, pairwise incompatibility packed in same vehicle, as well area weight capacity vehicles. An order can be delivered earlier than its date, incurring an earliness penalty storage requirements destination. objective is minimize total usage costs. A Mixed-Integer Linear Programming model (MILP) provided, Adaptive Large Neighbourhood Search (ALNS) algorithm. Results computational experiments on instances derived from real-world data show effectiveness ALNS